On the nonexistence of $[\binom{2m}{m-1}, 2m, \binom{2m-1}{m-1}]$, $m$ odd, complex orthogonal design
نویسندگان
چکیده
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| 2)In×n. Adams et al. in “The final case of the decoding delay problem for maximum rate complex orthogonal designs,” IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 103-122, Jan. 2010, first proved the nonexistence of [
منابع مشابه
A semi-recursion for the number of involutions in special orthogonal groups over finite fields
Let I(n) be the number of involutions in a special orthogonal group SO(n,Fq) defined over a finite field with q elements, where q is the power of an odd prime. Then the numbers I(n) form a semi-recursion, in that for m > 1 we have I(2m+ 3) = (q + 1)I(2m+ 1) + q(q − 1)I(2m− 2). We give a purely combinatorial proof of this result, and we apply it to give a universal bound for the character degree...
متن کاملPERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملHigh-rate, 2-group ML-decodable STBCs for 2m transmit antennas
A Space-Time Block Code (STBC) in K−variables is said to be g-Group ML-Decodable (GMLD) if its MaximumLikelihood (ML) decoding metric can be written as a sum of g independent terms, with each term being a function of a subset of the K variables. In this paper, a construction method to obtain high-rate, 2-GMLD STBCs for 2m transmit antennas, m > 1, is presented. The rate of the STBC obtained for...
متن کاملNonextendible Latin Cuboids
We show that for all integers m > 4 there exists a 2m × 2m ×m latin cuboid that cannot be completed to a 2m × 2m × 2m latin cube. We also show that for all even m / ∈ {2, 6} there exists a (2m−1) × (2m−1) × (m−1) latin cuboid that cannot be extended to any (2m−1)× (2m−1)×m latin cuboid.
متن کاملActive sites of stoichiometric cerium oxide cations (CemO2m+) probed by reactions with carbon monoxide and small hydrocarbon molecules.
Cerium oxide cluster cations (Ce(m)O(n)(+), m = 2-16; n = 2m, 2m +/- 1 and 2m +/- 2) are prepared by laser ablation and reacted with carbon monoxide (CO) and small hydrocarbon molecules (CH(4), C(2)H(4), and C(2)H(6)) in a fast flow reactor. A time of flight mass spectrometer is used to detect the cluster distribution before and after the reactions. The observation of oxygen reduction and hydro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1109.2891 شماره
صفحات -
تاریخ انتشار 2011